Nearly on line scheduling of preemptive independent tasks
نویسندگان
چکیده
منابع مشابه
On non-preemptive scheduling of period and sporadic tasks
This paper examines a fundamental problem in the theory of real-time scheduling, that of scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. We exhibit a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks. We then show that any set of perio...
متن کاملOn Non-Preemptive Scheduling of Periodic and Sporadic Tasks
This paper examines a fundamental problem in the theory of real-time scheduling, that of scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. We exhibit a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks. We then show that any set of perio...
متن کاملOn-line Multiprocessor Tasks Scheduling with Rejection
This paper deals with multiprocessor task scheduling with ready times, due dates and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by given ready times, respecting their due dates. Moreover, a task can be examined in order to be processed only when it enters the scheduler. The concept of rejection is int...
متن کاملPreemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the processors has speed 1 and the other has speed s¿1. The objective is to minimize the makespan. A best possible algorithm with competitive ratio of (1+s)=(1+s+s) is proposed for this problem. c © 1998 Elsevier Science B.V. All rights reserved.
متن کاملNearly On-Line Scheduling of Multiprocessor Systems with Memories
We show that no multiprocessor system that contains at least one processor with memory size smaller than at least two other processors can be scheduled nearly on line to minimize the finish time. An efficient nearly on line algorithm to minimize Cmax is developed for multiprocessor systems that do not satisfy the preceding requirement. Finally, we review the complexity of some other scheduling ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00105-m